منابع مشابه
Edge-disjoint spanners in tori
A spanning subgraph S = (V , E ) of a connected graph G = (V , E) is an (x + c)-spanner if for any pair of vertices u and v, dS(u, v) ≤ dG(u, v) + c where dG and dS are the usual distance functions in G and S, respectively. The parameter c is called the delay of the spanner. We study edge-disjoint spanners in graphs in multi-dimensional tori. We show that each two-dimensional torus has a set of...
متن کاملEdge-disjoint spanners of complete bipartite graphs
A spanning subgraph S=(V; E′) of a connected simple graph G=(V; E) is an (x+c)-spanner if for any pair of vertices u and v; dS(u; v)6dG(u; v)+c where dG and dS are the usual distance functions in graphs G and S, respectively. The parameter c is called the delay of the spanner. We investigate the number of edge-disjoint spanners of a given delay that can exist in complete bipartite graphs. We de...
متن کاملEdge-disjoint spanners in Cartesian products of graphs
A spanning subgraph S= (V ,E′) of a connected graph G= (V ,E) is an (x+ c)-spanner if for any pair of vertices u and v, dS(u, v) dG(u, v) + c where dG and dS are the usual distance functions in G and S, respectively. The parameter c is called the delay of the spanner. We study edge-disjoint spanners in graphs, focusing on graphs formed as Cartesian products. Our approach is to construct sets of...
متن کاملVertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case when the physical network is T (n), a torus of size n by n, the subnetworks are cycles and the communication scheme is all-to-all or total exchange (where all pairs of vertices communicate). We will r...
متن کاملWiring Edge-Disjoint Layouts
We consider the wiring or layer assignment problem for edge-disjoint layouts. The wiring problem is well understood for the case that the underlying layout graph is a square grid (see 7]). In this paper, we introduce a more general approach to this problem. For an edge-disjoint layout in the plane resp. in an arbitrary planar layout graph, we give equivalent conditions for the k-layer wirabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.04.063